#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read()
{LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1,map2;
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,k;cin>>n>>k;
  for(LL i=1;i<=n;i++) cin>>a[i],map1[a[i]]++;
  LL sum=0;
  for(LL i=1;i<=n;i++){
     map1[a[i]]--;
     if(a[i]%k==0){
        sum+=(map2[a[i]/k]*map1[a[i]*k]);
     }
     ++map2[a[i]];
  }
  cout<<sum<<"\n";
return 0;
}
